Evolutionary Algorithm-Based Complete Coverage Path Planning for Tetriamond Tiling Robots
نویسندگان
چکیده
منابع مشابه
PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملEvolutionary Path Planning Algorithm for Industrial Robots
This paper proposed a new methodology to solve collision free path planning problem for industrial robot using genetic algorithms. The method poses an optimization problem that aims to minimize the significant points traveling distance of the robot. The behaviour of more two operational parameters – the end effector traveling distance and computational time – is analysed. This algorithm is able...
متن کاملComplete coverage path planning of mobile robots for humanitarian demining
The paper presents a path planning algorithm for a non-circular shaped mobile robot to autonomously navigate in an unknown area for humanitarian demining. For that purpose the path planning problem comes down to planning a path from some starting location to a final location in an area so that the robot covers all the reachable positions in the area while following the planned path. Based on ou...
متن کاملpso-based path planning algorithm for humanoid robots considering safety
in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...
متن کاملCoverage Path Planning for Mobile Cleaning Robots
In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20020445